منابع مشابه
Infinite self-shuffling words
In this paper we introduce and study a new property of infinite words: An infinite word x ∈ A, with values in a finite set A, is said to be k-self-shuffling (k ≥ 2) if x admits factorizations: x = ∏∞ i=0 U (1) i · · ·U (k) i = ∏∞ i=0 U (1) i = · · · = ∏∞ i=0 U (k) i . In other words, there exists a shuffle of k-copies of x which produces x. We are particularly interested in the case k = 2, in w...
متن کاملInfinite square-free self-shuffling words
An infinite word w is called self-shuffling, if w = ∏ ∞ i=0 UiVi = ∏ ∞ i=0 Ui = ∏ ∞ i=0 Vi for some finite words Ui, Vi. Harju [4] recently asked whether square-free self-shuffling words exist. We answer this question affirmatively.
متن کاملInfinite permutations vs. infinite words
I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis et al. [4] permutations appear in a very similar framework as early as in 1977. I am going to tell about periodicity of permutations, their complexity accor...
متن کاملSelf-similar Discrete Rotation Configurations and Interlaced Sturmian Words
Rotation configurations for quadratic angles exhibit self-similar dynamics. Visually, it may be considered as quite evident. However, no additional details have yet been published on the exact nature of the arithmetical reasons that support this fact. In this paper, to support the existence of self-similar dynamic in 2d-configuration, we will use the constructive 1-d substitution theory in orde...
متن کاملRecurrence in Infinite Words
We survey some results and problems related to the notion of recurrence for infinite words.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00297-a